A π – calculus Semantics of Logical Variables and Unification
نویسنده
چکیده
A π–calculus semantics of terms and logical variables, environment creation visavis term copying and variable refreshing, and sequential unification is presented. The π–calculus’s object–oriented approach to modelling evolving communication structures is used to model the evolving communication environment found in concurrent logic program computations. The novelty of this semantics is that it explicitly models logic variables as active channels. These channels are referenced by π–calculus channel labels, and when used in concert with the ν restriction operator, model variable scopes and environments. Sequential unification without occurs check is modelled by traversing term expressions, and binding variables to terms as appropriate. The π–calculus is well-suited for this, as its object–oriented view of concurrency permits the modelling of the object passing and variable redirection that occurs during unification. This semantics is a central component of a more comprehensive operational semantics of concurrent logic programming languages currently being developed.
منابع مشابه
Proof Search Specifications of Bisimulation and Modal Logics for the π-calculus
We specify the operational semantics and bisimulation relations for the finite π-calculus within a logic that contains the ∇ quantifier for encoding generic judgments and definitions for encoding fixed points. Since we restrict to the finite case, the ability of the logic to unfold fixed points allows this logic to be complete for both the inductive nature of operational semantics and the coind...
متن کاملA Proof Search Specification of the π - Calculus DRAFT : April 19 , 2004
We present a meta-logic that contains a new quantifier ∇ (for encoding “generic judgments”) and inference rules for reasoning within fixed points of a given specification. We then specify the operational semantics and bisimulation relations for the finite π-calculus within this meta-logic. Since we restrict to the finite case, the ability of the meta-logic to reason within fixed points becomes ...
متن کاملProof Search Specifications for Bisimulation and Modal Logics for the π-calculus
We specify the operational semantics and bisimulation relations for the finite π-calculus within a logic that contains the ∇ quantifier for encoding generic judgments and definitions for encoding fixed points. Since we restrict to the finite case, the ability of the logic to unfold fixed points allows this logic to be complete for both the inductive nature of operational semantics and the coind...
متن کاملFull Abstraction for Polymorphic Pi-Calculus
The problem of finding a fully abstract model for the polymorphic π-calculus was stated in Pierce and Sangiorgi’s work in 1997 and has remained open since then. In this paper, we show that a slight variant of their language has a direct fully abstract model, which does not depend on type unification or logical relations. This is the first fully abstract model for a polymorphic concurrent langua...
متن کاملA Proof Search Specification of the π-Calculus
We present a meta-logic that contains a new quantifier ∇ (for encoding “generic judgments”) and inference rules for reasoning within fixed points of a given specification. We then specify the operational semantics and bisimulation relations for the finite π-calculus within this meta-logic. Since we restrict to the finite case, the ability of the meta-logic to reason within fixed points becomes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993